Graph cut - PDFSEARCH.IO - Document Search Engine

Graph cut
Results: 144

#	Item
111	SYMPHONY[removed]User’s Manual ∗ SYMPHONY Developed By T.K. Ralphs† L. Lad´anyi‡ Interactive Graph Drawing Add to Reading List Source URL: www.coin-or.org Language: English - Date: 2011-09-11 15:50:29 Applied mathematics Combinatorial optimization Linear programming relaxation Divide and conquer algorithm Algorithm Branch and cut COIN-OR Linear programming Cutting-plane method Mathematical optimization Mathematics Operations research
112	Graph-Cut Based Automatic Lung Boundary Detection in Chest Radiographs Add to Reading List Source URL: www.lhncbc.nlm.nih.gov Language: English - Date: 2014-08-09 02:09:50 Health Segmentation Graph cuts in computer vision Computer-aided diagnosis Active contour model Minimum spanning tree-based segmentation Simple interactive object extraction Computer vision Image processing Medicine
113	New Inapproximability Bounds for TSP Marek Karpinski∗ Michael Lampis† Richard Schmied‡ Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-26 06:58:50 Combinatorial optimization NP-complete problems Operations research Travelling salesman problem Matching Graph Cut Connectivity Eulerian path Graph theory Mathematics Theoretical computer science
114	Algorithmica[removed]: 323–342 DOI[removed]s00453[removed]Computing Minimum Cuts by Randomized Search Heuristics Frank Neumann · Joachim Reichel · Add to Reading List Source URL: page.math.tu-berlin.de Language: English Combinatorial optimization Operations research Network flow NP-complete problems Minimum cut Maximum flow problem Flow network Cut Maximum cut Graph theory Mathematics Theoretical computer science
115	JN[removed]Flow in transport networks 2 3 Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2006-05-18 12:16:21 Combinatorics Maximum flow problem Flow network Max-flow min-cut theorem Cut Ford–Fulkerson algorithm Push-relabel maximum flow algorithm Network flow Graph theory Mathematics
116	0 Efficient Relaxed Search in Hierarchically-Clustered Sequence Datasets ¨ Munchen ¨ KAI C. BADER, Technische Universitat Add to Reading List Source URL: grothoff.org Language: English - Date: 2013-04-18 09:43:57 Algorithm Mathematical logic Theoretical computer science Cut Bipartite graph Graph theory Mathematics Combinatorial optimization
117	2 Preliminaries A combinational boolean network is a directed acyclic graph (DAG) with nodes corresponding to logic gates and directed edges corresponding to wires connecting the gates. Incoming edges of a node are calle Add to Reading List Source URL: minisat.se Language: English - Date: 2009-12-31 17:36:11 Electronic engineering Diagrams Circuit Theory of computation Cut And-inverter graph Mathematics Theoretical computer science Graph connectivity Combinatorial optimization
118	Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗ Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2008-02-10 09:20:05 NP-complete problems Combinatorial optimization Maximum flow problem Graph coloring Cut Minimum k-cut Optimization problem Max-flow min-cut theorem Set cover problem Theoretical computer science Mathematics Graph theory
119	Trust-based recommendation systems: an axiomatic approach Reid Andersen∗ Abraham Flaxman∗ Christian Borgs∗ Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2008-01-13 21:45:10 Combinatorics Flow network Operations research Connectivity Directed acyclic graph Minimum cut Axiom Network theory Networks Graph theory Network flow Mathematics
120	Combinatorial Optimization and Statistical Physics Phillip M. Duxbury, Condensed Matter Theory, MSU Add to Reading List Source URL: www.pa.msu.edu Language: English - Date: 2007-02-21 08:51:29 Combinatorial optimization Spanning tree Lattice models Network theory Ising model Cut Matching Maximum flow problem Shortest path problem Mathematics Theoretical computer science Graph theory

UPDATE